WORST_CASE(?,O(n^2))

Solution:
---------

  "concat" :: ["A"(15, 15) x "A"(6, 15)] -(1)-> "A"(6, 15)
  "cons" :: ["A"(15, 15) x "A"(15, 15)] -(15)-> "A"(15, 15)
  "cons" :: ["A"(15, 15) x "A"(6, 15)] -(6)-> "A"(6, 15)
  "false" :: [] -(0)-> "A"(0, 1)
  "leaf" :: [] -(0)-> "A"(15, 15)
  "leaf" :: [] -(0)-> "A"(6, 15)
  "lessleaves" :: ["A"(6, 15) x "A"(6, 15)] -(1)-> "A"(0, 0)
  "true" :: [] -(0)-> "A"(1, 0)


Cost Free Signatures:
---------------------

  "concat" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "cons" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "false" :: [] -(0)-> "A"_cf(0, 0)
  "leaf" :: [] -(0)-> "A"_cf(0, 0)
  "lessleaves" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "true" :: [] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------
  "\"cons\"_A" :: ["A"(0, 0) x "A"(1, 0)] -(1)-> "A"(1, 0)
  "\"cons\"_A" :: ["A"(1, 1) x "A"(0, 1)] -(0)-> "A"(0, 1)
  "\"false\"_A" :: [] -(1)-> "A"(1, 0)
  "\"false\"_A" :: [] -(0)-> "A"(0, 1)
  "\"leaf\"_A" :: [] -(0)-> "A"(1, 0)
  "\"leaf\"_A" :: [] -(0)-> "A"(0, 1)
  "\"true\"_A" :: [] -(0)-> "A"(1, 0)
  "\"true\"_A" :: [] -(0)-> "A"(0, 1)